A New Ship Scheduling Set Packing Model Considering Limited Risk

A mathematical model for vehicle routing and scheduling problem with cross-docking by considering risk

Today, many companies after achieving improvements in manufacturing operations are focused on the improvement of distribution systems and have long been a strong tendency to optimize the distribution network in order to reduce logistics costs that the debate has become challenging. Improve the flow of materials, an activity considered essential to increase customer satisfaction. In this study, ...

A Branch-and-Price-and-Cut Method for Ship Scheduling with Limited Risk

Traditional ship-scheduling models ignore uncertainty, even in highly volatile markets. We present a set-packing model that limits risk using a quadratic variance constraint. After generating first-order linear constraints to represent the variance constraint, we develop a branch-and-price-and-cut algorithm for medium-sized ship-scheduling problems. Computational results are provided, and exten...

New facets for the set packing polytope

A New Model Considering Uncertainties for Power Market

Medium-term modeling of electricity market has essential role in generation expansion planning. On the other hand, uncertainties strongly affect modeling and consequently, strategic analysis of generation firms in the medium term. Therefore, models considering these uncertainties are highly required. Among uncertain variables considered in the medium term generation planning, demand and hyd...

New Greedy Heuristics For Set Cover and Set Packing

The Set Cover problem (SCP) and Set Packing problem (SPP) are standard NP-hard combinatorial optimization problems. Their decision problem versions are shown to be NP-Complete in Karp’s 1972 paper. We specify a rough guide to constructing approximation heuristics that may have widespread applications and apply it to devise greedy approximation algorithms for SCP and SPP, where the selection heu...